CHOKe a stateless active queue management scheme for approximating fair bandwidth allocation - INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies

نویسندگان

  • Rong Pan
  • Balaji Prabhakar
  • Konstantinos Psounis
چکیده

We investigate the problem of providing a fair bandwidth allocation to each of n flows that share the outgoing link of a congested router. The buffer at the outgoing link i s a simple FIFO, shared by packets belonging to the n flows. We devise a simple packet dropping scheme, called CHOKe, that discriminates against the Rows which submit more packets/sec than is allowed by their fair share. By doing this, the scheme aims to approximate the fair queueing policy. Sice it is stateless and easy to implement, CHOKe controls unresponsive or misbehaving flows with a minimum overhead’. Keyworhfair queueing, RED, active queue management, scheduling algorithm.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CHOKE, A Stateless Active Queue Management Scheme for Approximating Fair Bandwidth Allocation

We investigate the problem of providing a fair bandwidth allocation to each of n flows that share the outgoing link of a congested router. The buffer at the outgoing link is a simple FIFO, shared by packets belonging to the n flows. We devise a simple packet dropping scheme, called CHOKe, that discriminates against the flows which submit more packets/sec than is allowed by their fair share. By ...

متن کامل

A Stateless Active Queue Management Scheme for Approximating Fair Bandwidth Allocation and Stabilized Buffer Occupation

We investigate the problem of providing a fair bandwidth allocation to each of flows that share the outgoing link of a congested router. The buffer at the outgoing link is a simple FIFO, shared by packets belonging to the flows. We devise a simple packet dropping scheme, called CHOKe, that discriminates against the flows which submit more packets/sec than is allowed by their fair share. By doin...

متن کامل

A stateless active queue management scheme for approximating fair bandwidth allocation

We investigate the problem of providing a fair bandwidth allocation to each of flows that share the outgoing link of a congested router. The buffer at the outgoing link is a simple FIFO, shared by packets belonging to the flows. We devise a simple packet dropping scheme, called CHOKe, that discriminates against the flows which submit more packets/sec than is allowed by their fair share. By doin...

متن کامل

Quality of Service Driven Packet Scheduling Disciplines for Real-time Applications: Looking Beyond F - INFOCOM '99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies

In this paper we focus on real-time scheduling of “soft” realtime data services such as multimedia data, MPEG video streaming and IP telephony, which can tolerate a small degree of loss or delay. We argue that network operators and service providers should be able to select from a range of Quality of Service objectives, including maximizing the number of customers receiving good service. Furthe...

متن کامل

An Enhanced Random Early Marking Algorithm for Internet Flow Control - INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies

AbstructWe propose earlier an optimization based flow control for the Internet called Random Early Mark@ (REM). In this paper we propose and evaluate an enhancement that attempts to sped up the convergence of REM in the face of large feedback delays. REM can be regarded as an implementation of an optimization algorithm in a distributed network. The basic idea is to treat the optimization algori...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004